Efficient Sampling and Structure Learning of Bayesian Networks

نویسندگان

چکیده

Bayesian networks are probabilistic graphical models widely employed to understand dependencies in high-dimensional data, and even facilitate causal discovery. Learning the underlying network structure, which is encoded as a directed acyclic graph (DAG) highly challenging mainly due vast number of possible combination with acyclicity constraint. Efforts have focused on two fronts: constraint-based methods that perform conditional independence tests exclude edges score search approaches explore DAG space greedy or MCMC schemes. Here, we synthesize these fields novel hybrid method reduces complexity method. Individual steps scheme only require simple table lookups so very long chains can be efficiently obtained. Furthermore, includes an iterative procedure correct for errors from tests. The algorithm offers markedly superior performance alternatives, particularly because it also possibility sample DAGs their posterior distribution, enabling full model averaging much larger networks. Supplementary materials this article available online.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Structure Learning and Sampling of Bayesian Networks

Bayesian networks are probabilistic graphical models widely employed to understand dependencies in high dimensional data, and even to facilitate causal discovery. Learning the underlying network structure, which is encoded as a directed acyclic graph (DAG) is highly challenging mainly due to the vast number of possible networks. Efforts have focussed on two fronts: constraint based methods that...

متن کامل

 Structure Learning in Bayesian Networks Using Asexual Reproduction Optimization

A new structure learning approach for Bayesian networks (BNs) based on asexual reproduction optimization (ARO) is proposed in this letter. ARO can be essentially considered as an evolutionary based algorithm that mathematically models the budding mechanism of asexual reproduction. In ARO, a parent produces a bud through a reproduction operator; thereafter the parent and its bud compete to survi...

متن کامل

Structure Learning in Bayesian Networks of Moderate Size by Efficient Sampling

We study the Bayesian model averaging approach to learning Bayesian network structures (DAGs) from data. We develop new algorithms including the first algorithm that is able to efficiently sample DAGs according to the exact structure posterior. The DAG samples can then be used to construct estimators for the posterior of any feature. We theoretically prove good properties of our estimators and ...

متن کامل

Structure Learning in Bayesian Networks of a Moderate Size by Efficient Sampling

We study the Bayesian model averaging approach to learning Bayesian network structures (DAGs) from data. We develop new algorithms including the first algorithm that is able to efficiently sample DAGs of a moderate size (with up to about 25 variables) according to the exact structure posterior. The DAG samples can then be used to construct estimators for the posterior of any feature. We theoret...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Graphical Statistics

سال: 2022

ISSN: ['1061-8600', '1537-2715']

DOI: https://doi.org/10.1080/10618600.2021.2020127